Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Digital image Watermarking using Two Dimensional Discrete Wavelet Transform, Discrete Cosine Transform and Fast Fourier Transform

Abstract—In digital watermarking, a watermark is embedded into a cover text in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. This paper presents a digital image watermarking based on two dimensional discrete cosines transform (DCT2), two dimen...

متن کامل

Fast discrete cosine transform pruning

A new fast pruning algorithm is proposed for computing the IV, lowest frequency components of a Iength-~V discrete cosine transform, where AVO is any integer less than or equal to N, and AV = 2“‘. The computational complexity of the developed algorithm is lower than any of the existing algorithms, resulting in significant time savings. In the special case that AVO = 2 “ Q , the required number ...

متن کامل

Pruning the Two-Dimensional Fast Cosine Transform

Two pruning algorithms for the Vector-Radix Fast Cosine Transform are presented. Both are based on an in-place approach of the direct two-dimensional fast cosine transform (2D FCT). The first pruning algorithm concerns the computation of N0xN0 out of NxN DCT points, where both N0 and N are powers of 2. The second pruning algorithm is more general and concerns a recursive approach for the comput...

متن کامل

New fast algorithms of multidimensional Fourier and Radon discrete transforms

This paper describes a fast new n{D Discrete Radon Transform (DRT) and a fast exact inversion algorithm for it, without interpolating from polar to Cartesian coordinates or using the backprojection operator. New approach is based on the fast Nussbaumer's Polynomial Transform (NPT).

متن کامل

JPEG Encoder using Discrete Cosine Transform & Inverse Discrete Cosine Transform

In the past decade, the advancement in data communications was significant during explosive growth of the Internet, which led to the demand for using multimedia in portable devices. Video and Audio data streams require a huge amount of bandwidth to be transferred in an uncompressed form. The objective of this paper is to minimize the number of bits required to represent an image and also the ac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics Letters

سال: 1991

ISSN: 1350-911X

DOI: 10.1049/el:19910053